On All Strong Kleene Generalizations of Classical Logic
نویسنده
چکیده
By using the notions of exact truth (‘true and not false’) and exact falsity (‘false and not true’), one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the (extended) Strong Kleene schema. Besides familiar logics such as Strong Kleene logic (K3), the Logic of Paradox (LP) and First Degree Entailment (FDE), the resulting class of all Strong Kleene generalizations of classical logic also contains a host of unfamiliar logics. We first study the members of our class semantically, after which we present a uniform sequent calculus (the SK calculus) that is sound and complete with respect to all of them. Two further sequent calculi (the SK and SK calculus) will be considered, which serve the same purpose and which are obtained by applying general methods (due to Baaz et al.) to construct sequent calculi for many-valued logics. Rules and proofs in the SK calculus are much simpler and shorter than those of the SK and the SK calculus, which is one of the reasons to prefer the SK calculus over the latter two. Besides favourably comparing the SK calculus to both the SK and the SK calculus, we also hint at its philosophical significance.
منابع مشابه
Wintein On All Strong Kleene Generalizations of Classical Logic
By using the notions of exact truth (‘true and not false’) and exact falsity (‘false and not true’), one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the (extended) Strong Kleene schema. Besides familiar logics such as Str...
متن کاملSome remarks on generalizations of classical prime submodules
Let $R$ be a commutative ring with identity and $M$ be a unitary $R$-module. Suppose that $phi:S(M)rightarrow S(M)cup lbraceemptysetrbrace$ be a function where $S(M)$ is the set of all submodules of $M$. A proper submodule $N$ of $M$ is called an $(n-1, n)$-$phi$-classical prime submodule, if whenever $r_{1},ldots,r_{n-1}in R$ and $min M$ with $r_{1}ldots r_{n-1}min Nsetminusphi(N)$, then $r_{1...
متن کاملTheorem Proving for Classical Logic with Partial Functions by Reduction to Geometric Kleene Logic
Partial functions are abundant in mathematics and program specifications. Unfortunately, their importance has been mostly ignored in automated theorem proving. In this paper, we develop a theorem proving strategy for Partial Classical Logic (PCL). Proof search takes place in Kleene Logic. We show that PCL theories can be translated into sets of formulas in Kleene logic. For proof search in Klee...
متن کاملAxiomatizing Kripke's Theory of Truth
We investigate axiomatizations of Kripke’s [18] theory of truth based on the Strong Kleene evaluation scheme for treating sentences lacking a truth value. Feferman’s axiomatization KF formulated in classical logic is an indirect approach, because it is not sound with respect to Kripke’s semantics in the straightforward sense; only the sentences provably true in KF are valid in Kripke’s partial ...
متن کاملEpistemic semantics for classical and intuitionistic logic
1 In this paper I propose to explain how several nonstandard semantic systems for the propositional logic can be seen as employing essentially the same principles for defining the notion of logical entailment and the more basic idea of assignment of truth-values to molecular sentences. The systems are Kleene's three-valued matrix for the strong connectives, Lukasiewicz's three-valued matrix, su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 104 شماره
صفحات -
تاریخ انتشار 2016